Enhancing Information Reliability through Backwards Propagation Of Distrust
نویسنده
چکیده
Abstract—Search Engines have greatly influenced the way we experience the web. Since the early days of the web people have been relying on search engines to find useful information. However, their ability to provide useful and unbiased information can be manipulated by Web spammers. Web spamming, the practice of introducing artificial text and links into web pages to affect the results of searches, has been recognized as a major problem for search engines. But it is mainly a serious problem for web users because they tend to confuse trusting the search engine with trusting the results of a search. In this paper, first we discuss the relationship between Web spam in cyber world and social propaganda in the real world. Then, we propose “backwards propagation of distrust,” as an approach to finding spamming untrustworthy sites. Our approach is inspired by the social behavior associated with distrust. In society, recognition of an untrustworthy entity (person, institution, idea, etc) is a reason for questioning the trustworthiness of those that recommended this entity. People that are found to strongly support untrustworthy entities become untrustworthy themselves. In other words, in the society, distrust is propagated backwards. Our algorithm simulates this social behavior on the web graph with considerable success. Moreover, by respecting the user’s perception of trust through the web graph, our algorithm makes it possible to resolve the moral question of who should be making the decision of weeding out untrustworthy spammers in favor of the user, not the search engine or some higher authority. Our approach can lead to browser-level, or personalized server-side, web filters that work in synergy with the powerful search engines to deliver personalized, trusted web results. An earlier version of this paper was presented at [35].
منابع مشابه
A Many Valued Representation and Propagation of Trust and Distrust
As the amount of information on the web grows, users may find increasing challenges in trusting and sometimes distrusting sources. One possible aid is to maintain a network of trust between sources. In this paper, we propose to model such a network as an intuitionistic fuzzy relation. This allows to elegantly handle together the problem of ignorance, i.e. not knowing whether to trust or not, an...
متن کاملBilattice-Based Aggregation Operators for Gradual Trust and Distrust
Trust and distrust are two increasingly important metrics in social networks. Since many of these networks are very large, it is only natural that not all users know each other. To this aim, propagation and aggregation operators are often used to estimate (dis)trust relations for users that are not directly connected through the network. In this paper, we introduce bilattice-based aggregation a...
متن کاملWeb Spam, Propaganda and Trust
Web spamming, the practice of introducing artificial text and links into web pages to affect the results of searches, has been recognized as a major problem for search engines. It is also a serious problem for users because they are not aware of it and they tend to confuse trusting the search engine with trusting the results of a search [16]. The parallels between web spamming on the internet a...
متن کاملTrust networks in recommender systems
Trust is not only essential in our daily lives, its importance in virtual networks should not be underestimated either. For example, we only use information found on the web when we trust the source, and we do not give our credit card details on sites we distrust. With the advent of the semantic web [2], intelligent web agents will be taking over more and more human tasks. Therefore, there is a...
متن کاملPropagating Both Trust and Distrust with Target Differentiation for Combating Web Spam
Propagating trust/distrust from a set of seed (good/bad) pages to the entire Web has been widely used to combat Web spam. It has been mentioned that a combined use of good and bad seeds can lead to better results. However, little work has been known to realize this insight successfully. A serious issue of existing algorithms is that trust/distrust is propagated in non-differential ways. However...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009